|
|
Demonstration of Selected Graph Algorithms
Galanská, Katarína ; Martiško, Jakub (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with re-architecture of an existing application for the demonstration and visualization of selected graph algorithms. The goal of this thesis is to convert the application into multiple modules and make it easier to extend. OSGi technology helps to achieve the modularity. Its principles are explained and used to design and implementation of modules. With new architecture is also implemented the support for multilingual user interface using Eclipse Plugin internationalization. Graph algorithms represented as modules use OSGi Services. Dynamicity is ensured by installing the module and registering its service during the program's run time. The implementation also includes the creation of new modules for Prim's, Kruskal's, Edmond Karp's and modified Hierholzer's algorithm.
|
|
|
Mobile robot path planning
Klobušníková, Zuzana ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This master thesis deals with the planning of the robot's path using selected graph algorithms of artificial intelligence. The theoretical part describes the basic methods of planning a robot's path. It is related to the graph algorithm more closely. The practical part deals with implementation of selected graph algorithms, creation of simulation environment in Python, description and evaluation of experiments.
|
|
|
Demonstration of Graph Algorithms
Varadinek, Jakub ; Zámečníková, Eva (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with the development of the application for demonstration and visualization of several graph algorithms. The application allows the user to create a graph, rate edges or name and layout vertices. The individual algorithms can be performed in created graph for visual observation how the algorithm works. There is also the possibility of stepping through the chosen algorithm and an interactive mode where next steps are selected by the user and the application checks the correctness of these steps.
|
|
|
Shortest Paths in a Graph
Krauter, Michal ; Křivka, Zbyněk (referee) ; Masopust, Tomáš (advisor)
This thesis deals with shortest paths problem in graphs. Shortest paths problem is the basic issue of graph theory with many pracitcal applications. We can divide this problem into two following generalizations: single-source shortest path problem and all-pairs shortest paths problem. This text introduces principles and algorithms for generalizations. We describe both classical and new more efficient methods. It contains information about how some of these algorithms were implemented and offers an experimental comparison of these algorithms.
|
|
| |
|
|
Voice Controled Map of FIT
Huták, Petr ; Grézl, František (referee) ; Szőke, Igor (advisor)
This bachelor's thesis describes the design and developement of navigation system for the Faculty of information technology, Brno university of technology with voice control. It explains the methods used for finding the shortest path on the map, speech recognition and describes existing navigation systems with voice control. The thesis is focused on creating a user interface with voice control. The purpose of voice control is to make usage of this navigation system more accesible and effective in a public place. Speech recognizing is realized with BSAPI library.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
Automatic Node-Placement in an Oriented Acyclic Graph in a GUI Application
Juda, Jan ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
The goal of this work is to create an application for automatic node placement of acyclic oriented graphs. The work is mainly focusing on advanced possibilities of graph layout, for example selection of location of selected nodes, division of a graph into sub-graphs or support of polygonal nodes. The solution describes chosen algorithms, which are being used in the resulting application. Specifically, Fruchterman-Reingold force oriented algorithm, algorithm Kamada-Kawai and an algorithm based on Meyer's self-organizing graphs.
|
|
|
Registration of Photos to 3D Model
Deák, Jaromír ; Brejcha, Jan (referee) ; Čadík, Martin (advisor)
This work refers existing solutions and options for the task registration of photos to 3D model based on the previous knowledge of the geographic position of the camera. The contribution of the work are new ways and possibilities of the solution with the usage of graph algorithms. In this area, the work interests are useful points of interest detection in input data, a construction of graphs and graph matching possibilities.
|
|
|
Risk modelling in transportation
Lipovský, Tomáš ; Pavlas, Martin (referee) ; Popela, Pavel (advisor)
This thesis deals with theoretical basics of risk modelling in transportation and optimization using aggregated traffic data. In this thesis is suggested the procedure and implemented the application solving network problem of shortest path between geographical points. The thesis includes method for special paths evaluation depending on the frequency of traffic incidents based on real historical data. The thesis also includes a~graphical interface for presentation of the achieved results.
|
guest ::
